Colored Traveling Salesman Problem

Colored Traveling Salesman Problem and Solution

Multiple Traveling Salesman Problem (MTSP) is an important combinatorial optimization problem. However, it is applicable to only the cases in which multiple executing individuals (traveling salesman) share the common workspace (city set). It cannot be used to handle many multi-machine engineering systems where multiple machines’ workspaces are not the same and partially overlap with each other....

Solving the Inspection Problem via Colored Traveling Salesman Tours

This paper describes an effective approach to solve the inspection problem via colored traveling salesman tours. Given an environment with obstacles and regions to be inspected, the approach plans a collision-free and dynamicallyfeasible motion trajectory that enables the vehicle to inspect all the regions of interest while reducing the distance traveled. A key aspect of the approach is the tra...

An Approach for Solving Traveling Salesman Problem

In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illu...

The traveling salesman problem

Traveling Salesman Problem

In this paper we present a fast approach for solving large scale Traveling Salesman Problems (TSPs). The heuristic is based on Delaunay Triangulation and its runtime is therefore bounded by O(n log n). The algorithm starts by construction the convex hull and successively replaces one edge with two new edges of the triangulation, thus inserting a new city. The decision which edge to remove is ba...